An Algebraic Axiomatisation of ZX-calculus

نویسندگان

چکیده

ZX-calculus is a graphical language for quantum computing which complete in the sense that calculation matrices can be done purely diagrammatic way. However, all previous universally axiomatisations of have included at least one rule involving trigonometric functions such as sin and cos makes it difficult application purpose. In this paper we give an algebraic axiomatisation instead there are only ring operations involved phases. With ZX-calculus, able to establish first time simple translation diagrams from another called ZH-calculus derive ZX-translated rules ZH-calculus. As consequence, great benefit techniques obtained transplanted can't by just using completeness ZX-calculus.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics

We introduce the first complete and approximatively universal diagrammatic language for quantum mechanics. We make the ZX-Calculus, a diagrammatic language introduced by Coecke and Duncan, complete for the so-called Clifford+T quantum mechanics by adding four new axioms to the language. The completeness of the ZX-Calculus for Clifford+T quantum mechanics was one of the main open questions in ca...

متن کامل

Categorifying the zx-calculus

This paper presents a symmetric monoidal and compact closed bicategory that categorifies the zx-calculus developed by Coecke and Duncan. The 1-cells in this bicategory are certain graph morphisms that correspond to the string diagrams of the zx-calculus, while the 2-cells are rewrite rules.

متن کامل

A Simplified Stabilizer ZX-calculus

The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: a stabilizer ZX-diagram can be transformed into another one if and only if these two diagrams represent the same quantum evolution or quantum state. We show that the stabilizer ZX-calculus can be simplified, removing unnecessary equations while keeping only the ...

متن کامل

Axiomatisation of an Interval Calculus for Theorem Proving

We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to automatically prove laws for reasoning about predicates expressed using interval operators. These laws can be then used in the automatic veriication of real-time applications.

متن کامل

A nominal axiomatisation of the lambda-calculus

The lambda-calculus is a fundamental syntax in computer science. It resists an algebraic treatment because of captureavoidance side-conditions. Nominal algebra is a logic of equality designed with formalisation of specifications involving binding in mind. In this paper we axiomatise the lambda-calculus using nominal algebra, demonstrate how proofs with these axioms reflect the informal argument...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2021

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.340.16